Quantifying Timing Leaks and Cost Optimisation

We develop a new notion of security against timing attacks where the attacker is able to simultaneously observe the execution time of a program and the probability of the values of low variables. We then show how to measure the security of a program with respect to this notion via a computable estimate of the timing leakage and use this estimate for cost optimisation.Comment: 16 pages, 2 figures, 4 tables. A shorter version is included in the proceedings of ICICS'08 - 10th International Conference on Information and Communications Security, 20-22 October, 2008 Birmingham, U

A computational group theoretic symmetry reduction package for the SPIN model checker

Symmetry reduced model checking is hindered by two problems: how to identify state space symmetry when systems are not fully symmetric, and how to determine equivalence of states during search. We present TopSpin, a fully automatic symmetry reduction package for the Spin model checker. TopSpin uses the Gap computational algebra system to effectively detect state space symmetry from the associated Promela specification, and to choose an efficient symmetry reduction strategy by classifying automorphism groups as a disjoint/wreath product of subgroups. We present encouraging experimental results for a variety of Promela examples

Probabilistic abstract interpretation: From trace semantics to DTMC’s and linear regression

In order to perform probabilistic program analysis we need to consider probabilistic languages or languages with a probabilistic semantics, as well as a corresponding framework for the analysis which is able to accommodate probabilistic properties and properties of probabilistic computations. To this purpose we investigate the relationship between three different types of probabilistic semantics for a core imperative language, namely Kozen’s Fixpoint Semantics, our Linear Operator Semantics and probabilistic versions of Maximal Trace Semantics. We also discuss the relationship between Probabilistic Abstract Interpretation (PAI) and statistical or linear regression analysis. While classical Abstract Interpretation, based on Galois connection, allows only for worst-case analyses, the use of the Moore-Penrose pseudo inverse in PAI opens the possibility of exploiting statistical and noisy observations in order to analyse and identify various system properties

Oncogenic K-Ras suppresses IP₃-dependent Ca²⁺ release through remodeling of IP₃Rs isoform composition and ER luminal Ca²⁺ levels in colorectal cancer cell lines

The GTPase Ras is a molecular switch engaged downstream of G-protein coupled receptors and receptor tyrosine inases that controls multiple cell fate-determining signalling athways. Ras signalling is frequently deregulated in cancer underlying associated changes in cell phenotype. Although Ca2+ signalling pathways control some overlapping functions with Ras, and altered Ca2+ signalling pathways are emerging as important players in oncogenic transformation, how Ca2+ signalling is remodelled during transformation and whether it has a causal role remains unclear. We have investigated Ca2+ signalling in two human colorectal cancer cell lines and their isogenic derivatives in which the mutated K-Ras allele (G13D) has been deleted by homologous recombination. We show that agonist-induced Ca2+ release from intracellular stores is enhanced by loss of K-RasG13D through an increase in the ER store content and a modification of IP3R subtype abundance. Consistently, uptake of Ca2+ into mitochondria and sensitivity to apoptosis was enhanced as a result of KRasG13D loss. These results suggest that suppression of Ca2+ signalling is a common response to naturally occurring levels of K-RasG13D that contributes to a survival advantage during oncogenic transformation

An Algorithmic Approach to Quantum Field Theory

The lattice formulation provides a way to regularize, define and compute the Path Integral in a Quantum Field Theory. In this paper we review the theoretical foundations and the most basic algorithms required to implement a typical lattice computation, including the Metropolis, the Gibbs sampling, the Minimal Residual, and the Stabilized Biconjugate inverters. The main emphasis is on gauge theories with fermions such as QCD. We also provide examples of typical results from lattice QCD computations for quantities of phenomenological interest.Comment: 44 pages, to be published in IJMP

Hamming distance kernelisation via topological quantum computation

We present a novel approach to computing Hamming distance and its kernelisation within Topological Quantum Computation. This approach is based on an encoding of two binary strings into a topological Hilbert space, whose inner product yields a natural Hamming distance kernel on the two strings. Kernelisation forges a link with the field of Machine Learning, particularly in relation to binary classifiers such as the Support Vector Machine (SVM). This makes our approach of potential interest to the quantum machine learning community

Light hadrons with improved staggered quarks: approaching the continuum limit

We have extended our program of QCD simulations with an improved Kogut-Susskind quark action to a smaller lattice spacing, approximately 0.09 fm. Also, the simulations with a approximately 0.12 fm have been extended to smaller quark masses. In this paper we describe the new simulations and computations of the static quark potential and light hadron spectrum. These results give information about the remaining dependences on the lattice spacing. We examine the dependence of computed quantities on the spatial size of the lattice, on the numerical precision in the computations, and on the step size used in the numerical integrations. We examine the effects of autocorrelations in "simulation time" on the potential and spectrum. We see effects of decays, or coupling to two-meson states, in the 0++, 1+, and 0- meson propagators, and we make a preliminary mass computation for a radially excited 0- meson.Comment: 43 pages, 16 figure

How the mere desire for certainty can lead to a preference for men in authority (particularly among political liberals)

Women are harmed by stereotypes about their fit for positions of authority and changing these stereotypes is not a simple task. As stereotypes have strong epistemic properties, individuals with a high need for cognitive closure (NCC; i.e., the desire for epistemic certainty) can be more likely to accept these stereotypes and, consequently, to prefer men in positions of authority. Consistent with the reactive liberal hypothesis, this effect could be actually more visible among individuals with both a high NCC and left-wing political orientations. We supported these hypotheses in a series of three studies. In Study 1 (N = 217), we found that manipulated NCC predicted preference for men in authority through stereotypes of women as not being fit for authority in a measurement-of-mediation design. In Study 2 (N = 151), we supported this effect in a mediation-as-process design. In Study 3 (N = 391), we found the indirect NCC effect on preference for men in authority was more visible among political liberals. A major implication of this work is that ways of changing the effect of these stereotypes should take into account the NCC, but particularly among individuals with left-wing beliefs

On dynamical probabilities, or: how to learn to shoot straight

© IFIP International Federation for Information Processing 2016.In order to support, for example, a quantitative analysis of various algorithms, protocols etc. probabilistic features have been introduced into a number of programming languages and calculi. It is by now quite standard to define the formal semantics of (various) probabilistic languages, for example, in terms of Discrete Time Markov Chains (DTMCs). In most cases however the probabilities involved are represented by constants, i.e. one deals with static probabilities. In this paper we investigate a semantical framework which allows for changing, i.e. dynamic probabilities which is still based on time-homogenous DTMCs, i.e. the transition matrix representing the semantics of a program does not change over time

Detection of noise-corrupted sinusoidal signals with Josephson junctions

We investigate the possibility of exploiting the speed and low noise features of Josephson junctions for detecting sinusoidal signals masked by Gaussian noise. We show that the escape time from the static locked state of a Josephson junction is very sensitive to a small periodic signal embedded in the noise, and therefore the analysis of the escape times can be employed to reveal the presence of the sinusoidal component. We propose and characterize two detection strategies: in the first the initial phase is supposedly unknown (incoherent strategy), while in the second the signal phase remains unknown but is fixed (coherent strategy). Our proposals are both suboptimal, with the linear filter being the optimal detection strategy, but they present some remarkable features, such as resonant activation, that make detection through Josephson junctions appealing in some special cases.Comment: 22 pages, 13 figure